The Complexity of Counting Graph Homomorphisms Draft: 1 April 1999
نویسنده
چکیده
The problem of counting graph homomorphisms is considered. We show that the counting problem corresponding to a given graph is #P-complete unless every connected component of the graph is an isolated vertex without a loop, a complete graph with all loops present, or a complete unlooped bipartite graph.
منابع مشابه
Counting Restricted Homomorphisms via Möbius Inversion over Matroid Lattices
We present a framework for the complexity classification of parameterized counting problems that can be formulated as the summation over the numbers of homomorphisms from small pattern graphs H1, . . . ,H` to a big host graph G with the restriction that the coefficients correspond to evaluations of the Möbius function over the lattice of a graphic matroid. This generalizes the idea of Curticape...
متن کاملCounting Partitions of Graphs
Recently, there has been much interest in studying certain graph partitions that generalize graph colourings and homomorphisms. They are described by a pattern, usually viewed as a symmetric {0, 1, ∗}matrix M . Existing results focus on recognition algorithms and characterization theorems for graphs that admit such M -partitions, or M partitions in which vertices of the input graph G have lists...
متن کاملCounting Edge-Injective Homomorphisms and Matchings on Restricted Graph Classes
We consider the parameterized problem of counting all matchings with exactly k edges in a given input graph G. This problem is #W[1]-hard (Curticapean, ICALP 2013), so it is unlikely to admit f(k) · nO(1) time algorithms. We show that #W[1]-hardness persists even when the input graph G comes from restricted graph classes, such as line graphs and bipartite graphs of arbitrary constant girth and ...
متن کاملThe Complexity of Counting Surjective Homomorphisms and Compactions
A homomorphism from a graph G to a graph H is a function from the vertices of G to the vertices of H that preserves edges. A homomorphism is surjective if it uses all of the vertices of H and it is a compaction if it uses all of the vertices of H and all of the non-loop edges of H . Hell and Nešetřil gave a complete characterisation of the complexity of deciding whether there is a homomorphism ...
متن کاملHomomorphisms are indeed a good basis for counting: Three fixed-template dichotomy theorems, for the price of one
Many natural combinatorial quantities can be expressed by counting the number of homomorphisms to a fixed relational structure. For example, the number of 3-colorings of an undirected graph $G$ is equal to the number of homomorphisms from $G$ to the $3$-clique. In this setup, the structure receiving the homomorphisms is often referred to as a template; we use the term template function to refer...
متن کامل